Optimized synthesis of self-testable finite state machines

نویسندگان

  • Bernhard Eschermann
  • Hans-Joachim Wunderlich
چکیده

In this paper a synthesis procedure (or self-tenable finite nalt machines is presenled. Tenability is abudy considered while transforming the behavioral description of the Muil into • struCtural description. To this end a novel state encoding algorithm as well as a modified self'lI::s! architecture are devel oped. Expc:rimentalrcsuiu show that this approach leads to a significant reduction of hardware overflead.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Easily testable PLA-based finite state machines

the area and timing penalty associated with LSSD techniques are not acceptable to designers. In this paper, we outline a synthesis procedure, which Logic synthesis and minimization techniques can, in beginning from a State Transition Graph description principle, ensure fully and easily testable combinational of a sequential machine, produces an optimized easily and sequential circuit designs. I...

متن کامل

On implementation of online testable state machines

This paper presents a technique for designing self–checking finite state machines that uses a 2-hot code for state encoding. The registers and output logic in resulting state machines are testable online. A new method for designing the output logic is also proposed in this paper Key-Words: Fault Detection, State Machines, Online Testing, Transient Faults, Permanent Faults

متن کامل

Irredundant sequential machines via optimal logic synthesis

optimal sequential logic synthesis can produce fallv testable nonscan finite state machines. Test generation algorithms can be used It is well known that optimal logic synthesis can ensure fully to remove all the redundancies in sequential machines resulting in testable combinational logic designs. In this paper. we show that fuily testable designs. However. in general. this method requires opt...

متن کامل

Synthesis of Fast On-Line Testable Controllers for Data-Domi- nated Applications

A target structure for implementing fast on-line testable control units for data-dominated applications is presented. In many cases, the proposed controller structure leads to a performance improvement of more than 30% for a standard benchmark set whereas the area overhead is less than 15% compared with conventional on-line testable finite state machines (FSM). The proposed approach is compatib...

متن کامل

An Approach for Designing On-Line Testable State Machines

1. Introduction Synthesis of state machines have attracted the attention of researchers for more than two decades. Several state assignment techniques that result in efficient implementation of the next state logic have been developed [1-3]. However, none of these addresses the testability of an implemented machine. A popular approach for enhancing the testability of a state machine is to modif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990